A Fully Abstract Model for the π - calculus
نویسندگان
چکیده
This paper provides both a fully abstract (domain-theoretic) model for the π -calculus and a universal (set-theoretic) model for the finite π -calculus with respect to strong late bisimulation and congruence. This is done by considering categorical models, defining a metalanguage for these models, and translating the π -calculus into the metalanguage. A technical novelty of our approach is an abstract proof of full abstraction: The result on full abstraction for the finite π -calculus in the set-theoretic model is axiomatically extended to the whole π -calculus with respect to the domain-theoretic interpretation. In this proof, a central role is played by the description of nondeterminism as a free construction and by the equational theory of the metalanguage. C © 2002 Elsevier Science (USA)
منابع مشابه
Full Abstraction for Polymorphic Pi-Calculus
The problem of finding a fully abstract model for the polymorphic π-calculus was stated in Pierce and Sangiorgi’s work in 1997 and has remained open since then. In this paper, we show that a slight variant of their language has a direct fully abstract model, which does not depend on type unification or logical relations. This is the first fully abstract model for a polymorphic concurrent langua...
متن کاملA Fully Abstract Domain Model for the π-Calculus
Abramsky’s domain equation for bisimulation and the author’s categorical models for names combine to give a domain-theoretic model for the π-calculus. This is set in a functor category which provides a syntax-free interpretation of fresh names, privacy, visibility and non-interference between processes. The model is fully abstract for strong late bisimilarity and equivalence (bisimilarity under...
متن کاملA fully abstract coalgebraic semantics for the pi-calculus under weak bisimilarity
Combining traces, coalgebra and lazy-filtering channel configurations for parallel composition, we give a fully-abstract denotational semantics for the π-calculus under weak early bisimilarity.
متن کاملLudics is a Model for the Finitary Linear Pi-Calculus
We analyze in game-semantical terms the finitary fragment of the linear π-calculus. This calculus was introduced by Yoshida, Honda, and Berger [NYB01], and then refined by Honda and Laurent [LH06]. The features of this calculus asynchrony and locality in particular have a precise correspondence in Game Semantics. Building on work by Varacca and Yoshida [VY06], we interpret π-processes in linear...
متن کاملFree-Algebra Models for the π-Calculus
The finite π-calculus has an explicit set-theoretic functor-category model that is known to be fully abstract for strong late bisimulation congruence. We characterize this as the initial free algebra for an appropriate set of operations and equations in the enriched Lawvere theories of Plotkin and Power. Thus we obtain a novel algebraic description for models of the π-calculus, and validate an ...
متن کامل